Verifying programs that use causally-ordered message-passing

Verifying Programs That Use Causally-Ordered Message-Passing

We give an operational model of causally-ordered message-passing primitives. Based on this model, we formulate a Hoare-style proof system for causally-ordered delivery. To illustrate the use of this proof system and to demonstrate the feasibility of applying invariant-based verification techniques to algorithms that depend on causally-ordered delivery, we verify an asynchronous variant of the d...

Efficient memory management for concurrent programs that use message passing

We present an efficient memory management scheme for concurrent programming languages where communication occurs by using message passing with copying semantics. The runtime system is built around process-local heaps, which frees the memory manager from redundant synchronization in a multi-threaded implementation and allows the memory reclamation of process-local heaps to be a private business ...

Verifying Programs That Use

Verifying Concurrent Message-Passing C Programs with Recursive Calls

We consider the model-checking problem for C programs with (1) data ranging over very large domains, (2) (recursive) procedure calls, and (3) concurrent parallel components that communicate via synchronizing actions. We model such programs using communicating pushdown systems, and reduce the reachability problem for this model to deciding the emptiness of the intersection of two context-free la...

Modularization, re-use and testing for parallel message-passing programs

The advantages of modularization which are wellknown in sequential programming should also be exploited when designing and developing parallel programs. We investigate the requirements for such a concept in the context of an explicit, imperative message-passing programming language for the distributed memory paradigm. The language is a hybrid one in the sense that all parallel aspects are speci...